|
In set theory, the disjoint union (or discriminated union) of a family of sets is a modified union operation that indexes the elements according to which set they originated in. Or slightly different from this, the disjoint union of a family of subsets is the usual union of the subsets which are pairwise disjoint – disjoint sets means they have no element in common. Note that these two concepts are different but strongly related. Moreover, it seems that they are essentially identical to each other in category theory. That is, both are realizations of the coproduct of category of sets. ==Example== Disjoint union of sets = and = can be computed by finding: : so : 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「disjoint union」の詳細全文を読む スポンサード リンク
|